The Asymptotic Statistics of Random Covering Surfaces
نویسندگان
چکیده
Abstract Let $\Gamma _{g}$ be the fundamental group of a closed connected orientable surface genus $g\geq 2$ . We develop new method for integrating over representation space $\mathbb {X}_{g,n}=\mathrm {Hom}(\Gamma _{g},S_{n})$ , where $S_{n}$ is symmetric permutations $\{1,\ldots ,n\}$ Equivalently, this all vertex-labeled, n -sheeted covering spaces g Given $\phi \in \mathbb {X}_{g,n}$ and $\gamma \Gamma we let $\mathsf {fix}_{\gamma }(\phi )$ number fixed points permutation (\gamma The function }$ special case natural family functions on called Wilson loops. Our methodology leads to an asymptotic formula, as $n\to \infty $ expectation with respect uniform probability measure which denoted by {E}_{g,n}[\mathsf }]$ prove that if not identity q maximal such th power in then $$\begin{align*}\mathbb{E}_{g,n}\left[\mathsf{fix}_{\gamma}\right]=d(q)+O(n^{-1}) \end{align*}$$ $d\left (q\right divisors Even weaker corollary }]=o(n)$ result paper. also can approximated any order $O(n^{-M})$ polynomial $n^{-1}$
منابع مشابه
asymptotic property of order statistics and sample quntile
چکیده: فرض کنید که تابعی از اپسیلون یک مجموع نامتناهی از احتمالات موزون مربوط به مجموع های جزئی براساس یک دنباله از متغیرهای تصادفی مستقل و همتوزیع باشد، و همچنین فرض کنید توابعی مانند g و h وجود دارند که هرگاه امید ریاضی توان دوم x متناهی و امیدریاضی x صفر باشد، در این صورت می توان حد حاصلضرب این توابع را بصورت تابعی از امید ریاضی توان دوم x نوشت. حالت عکس نیز برقرار است. همچنین ما با استفاده...
15 صفحه اولAsymptotic behavior of some statistics in Ewens random permutations
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We describe the asymptotic behavior of a large family of statistics, including the number of occurrences of any given dashed pattern. Our approach is based on th...
متن کاملAsymptotic Cost of Cutting Down Random Free Trees
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of...
متن کاملCovering Rational Ruled Surfaces
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization without affine base points and such that the degree of the corresponding maps is preserved.
متن کاملAsymptotic Clique Covering Ratios of Distance Graphs
Given a finite set D of positive integers, the distance graph G(Z,D) has Z as the vertex set and {ij : |i−j| ∈ D} as the edge set. Given D, the asymptotic clique covering ratio is defined as S(D) = lim sup n→∞ n cl(n) , where cl(n) is the minimum number of cliques covering any consecutive n vertices of G(Z,D). The parameter S(D) is closely related to the ratio spT(G) χ(G) of a graph G, where χ(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Pi
سال: 2023
ISSN: ['2050-5086']
DOI: https://doi.org/10.1017/fmp.2023.13